Inexact Newton-Landweber Iteration in Banach Spaces with NonSmooth Convex Penalty Terms

نویسنده

  • Qinian Jin
چکیده

By making use of tools from convex analysis, we formulate an inexact NewtonLandweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme. The inner scheme provides increments by applying Landweber iteration with non-smooth uniformly convex penalty terms to local linearized equations. The outer iteration is then terminated by the discrepancy principle. Detailed convergence analysis is present under standard conditions on the nonlinearity. Finally, numerical simulations are reported to test the performance of the method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Landweber-kaczmarz Method in Banach Spaces with Inexact Inner Solvers

In recent years Landweber(-Kaczmarz) method has been proposed for solving nonlinear ill-posed inverse problems in Banach spaces using general convex penalty functions. The implementation of this method involves solving a (nonsmooth) convex minimization problem at each iteration step and the existing theory requires its exact resolution which in general is impossible in practical applications. I...

متن کامل

Inexact Newton–Landweber iteration for solving nonlinear inverse problems in Banach spaces

By making use of duality mappings, we formulate an inexact Newton– Landweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme providing the increments by applying the Landweber iteration in Banach spaces to the local linearized equations. It has the advantage of reducing computational w...

متن کامل

Global convergence of an inexact interior-point method for convex quadratic‎ ‎symmetric cone programming‎

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

متن کامل

On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems

In this paper we propose an extension of the iteratively regularized Gauss– Newton method to the Banach space setting by defining the iterates via convex optimization problems. We consider some a posteriori stopping rules to terminate the iteration and present the detailed convergence analysis. The remarkable point is that in each convex optimization problemwe allow non-smooth penalty terms inc...

متن کامل

Convergence results‎: ‎A new type iteration scheme for two asymptotically nonexpansive mappings in uniformly convex Banach spaces

‎In this article‎, ‎we introduce a new type iterative scheme for‎ ‎approximating common fixed points of two asymptotically‎ ‎nonexpansive mappings is defined‎, ‎and weak and strong convergence‎ ‎theorem are proved for the new iterative scheme in a uniformly‎ ‎convex Banach space‎. ‎The results obtained in this article‎ ‎represent an extension as well as refinement of previous known‎ ‎resu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2015